Information boundedness principle in fuzzy inference process
نویسندگان
چکیده
The information boundedness principle requires that the knowledge obtained as a result of an inference process should not have more information than that contained in the consequent of the rule. From this point of view relevancy transformation operators as a generalization of implications are investigated.
منابع مشابه
THE UNIFORM BOUNDEDNESS PRINCIPLE IN FUZZIFYING TOPOLOGICAL LINEAR SPACES
The main purpose of this study is to discuss the uniform boundednessprinciple in fuzzifying topological linear spaces. At first theconcepts of uniformly boundedness principle and fuzzy equicontinuousfamily of linear operators are proposed, then the relations betweenfuzzy equicontinuous and uniformly bounded are studied, and with thehelp of net convergence, the characterization of fuzzyequiconti...
متن کاملDouble Fuzzy Implications-Based Restriction Inference Algorithm
The main condition of the differently implicational inferencealgorithm is reconsidered from a contrary direction, which motivatesa new fuzzy inference strategy, called the double fuzzyimplications-based restriction inference algorithm. New restrictioninference principle is proposed, which improves the principle of thefull implication restriction inference algorithm. Furthermore,focusing on the ...
متن کاملDomination and Information Boundedness Principle for Aggregation
The information boundedness principle for rule based inference process requires that the knowledge obtained as a result of a rule should not have more information than that contained in the consequent of this rule. We formulate the information boundedness principle for aggregation and show that it can be expressed using the notion of dominance. We also investigate conditions under which this pr...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Kybernetika
دوره 38 شماره
صفحات -
تاریخ انتشار 2002